System-theoretical algorithmic solution to waiting times in semi-Markov queues
نویسندگان
چکیده
منابع مشابه
System-theoretical algorithmic solution to waiting times in semi-Markov queues
Markov renewal processes with matrix-exponential semi-Markov kernels provide a generic tool for modeling auto-correlated interarrival and service times in queueing systems. In this paper, we study the steady-state actual waiting time distribution in an infinite capacity single-server semi-Markov queuewith the auto-correlation in interarrival and service timesmodeled byMarkov renewal processes w...
متن کاملWaiting times in queues with relative priorities
This paper determines the mean waiting times for a single server multi-class queueing model with Poisson arrivals and relative priorities. If the server becomes idle, the probability that the next job is from class-i is proportional to the product between the number of class-i jobs present and their priority parameter. © 2006 Elsevier B.V. All rights reserved.
متن کاملOn the waiting times in queues with dependency between interarrival and service times
In this paper a queueing system with partial correlation is considered. We assume that the amount of work (service time) brought in by a customer and the subsequent interarrival time are dependent. We show that in this case stronger dependence between interarrival and service times leads to decreasing waiting times in the increasing convex ordering sense. This generalizes a result of Chao (Oper...
متن کاملGraph transformation method for calculating waiting times in Markov chains.
We describe an exact approach for calculating transition probabilities and waiting times in finite-state discrete-time Markov processes. All the states and the rules for transitions between them must be known in advance. We can then calculate averages over a given ensemble of paths for both additive and multiplicative properties in a nonstochastic and noniterative fashion. In particular, we can...
متن کاملOn queues with service and interarrival times depending on waiting times
W D = max{0, B − A + YW}, where P[Y = 1] = p and P[Y = −1] = 1 − p. For p = 1 this model reduces to the classical Lindley equation for the waiting time in the G/G/1 queue, whereas for p = 0 it describes the waiting time of the server in an alternating service model. For all other values of p this model describes a FCFS queue in which the service times and interarrival times depend linearly and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Performance Evaluation
سال: 2009
ISSN: 0166-5316
DOI: 10.1016/j.peva.2009.05.001